package LeetCode;

public class LC_521_LongestUncommonSubsequenceI {

    public static void main(String[] args) {

    }

    class Solution_1 {
        public int findLUSlength(String a, String b) {
            int lenA = a.length();
            int lenB = b.length();
            if (lenA != lenB)
                return Math.max(lenA, lenB);
            else if (!a.equals(b))
                return lenA;
            else
                return -1;
        }

    }
}